Termination Proof Script

Consider the TRS R consisting of the rewrite rules
1:    app(app(mapbt,f),app(leaf,x))  → app(leaf,app(f,x))
2:    app(app(mapbt,f),app(app(app(branch,x),l),r))  → app(app(app(branch,app(f,x)),app(app(mapbt,f),l)),app(app(mapbt,f),r))
There are 8 dependency pairs:
3:    APP(app(mapbt,f),app(leaf,x))  → APP(leaf,app(f,x))
4:    APP(app(mapbt,f),app(leaf,x))  → APP(f,x)
5:    APP(app(mapbt,f),app(app(app(branch,x),l),r))  → APP(app(app(branch,app(f,x)),app(app(mapbt,f),l)),app(app(mapbt,f),r))
6:    APP(app(mapbt,f),app(app(app(branch,x),l),r))  → APP(app(branch,app(f,x)),app(app(mapbt,f),l))
7:    APP(app(mapbt,f),app(app(app(branch,x),l),r))  → APP(branch,app(f,x))
8:    APP(app(mapbt,f),app(app(app(branch,x),l),r))  → APP(f,x)
9:    APP(app(mapbt,f),app(app(app(branch,x),l),r))  → APP(app(mapbt,f),l)
10:    APP(app(mapbt,f),app(app(app(branch,x),l),r))  → APP(app(mapbt,f),r)
The approximated dependency graph contains one SCC: {4-6,8-10}.
Tyrolean Termination Tool  (0.13 seconds)   ---  May 3, 2006